Fuzzy Extractors

نویسندگان

  • Yevgeniy Dodis
  • Leonid Reyzin
  • Adam Smith
چکیده

This chapter presents a general approach for handling secret biometric data in cryptographic applications. The generality manifests itself in two ways: we attempt to minimize the assumptions we make about the data, and to present techniques that are broadly applicable wherever biometric inputs are used. Because biometric data comes from a variety of sources that are mostly outside of anyone’s control, it is prudent to assume as little as possible about how they are distributed; in particular, an adversary may know more about a distribution than a system’s designers and users. Of course, one may attempt to measure some properties of a biometric distribution, but relying on such measurements in the security analysis is dangerous, because the adversary may have even more accurate measurements available to it. For instance, even assuming that some property of a biometric behaves according to a binomial distribution (or some similar discretization of the normal distribution), one could determine the mean of this distribution only to within ≈ 1 √ n after taking n samples; a well-motivated adversary can take more measurements, and thus determine the mean more accurately. Rather than assuming that some statistical information about the biometric input is available, we assume only that the input is unpredictable: i.e., that if an adversary is allowed a single guess at the value of the input, the likelihood that it is correct is 2−m for some m. This is a minimal assumption in the applications we consider: indeed, if the input is easily guessed, then one cannot use it to derive, say, a secret key for encryption or remote authentication. Of course, determining the exact value of m may in itself present a challenge; however, some lower bound on m is necessary for any sort of security claims. Similarly, while some understanding of errors in biometric measurements is possible, we prefer to minimize the assumptions we make about such errors. We assume only that a subsequent measurement is within a given, allowed distance of the measurement taken at enrollment. The broad applicability of the approaches presented here stems from the initial observation that many prior solutions for specific security problems based on noisy data (including biometrics) shared essential techniques and analyses. Instead of designing solutions for each particular setting as it arises, it seems worthwhile to consider the properties that such solutions share, and encapsulate them into primitives that can be used in a variety of contexts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Possibilities and Limitations of Computational Fuzzy Extractors

We present positive and negative results of fuzzy extractors with computational security. As a negative result, we show that, under a certain computational condition, the existence of a computational fuzzy extractor implies the existence of an information-theoretic fuzzy extractor with slightly weaker parameters. The condition is that the generation procedure of the fuzzy extractor is efficient...

متن کامل

On the Limitations of Computational Fuzzy Extractors

We present a negative result of fuzzy extractors with computational security. Specifically, we show that, under a certain computational condition, the existence of a computational fuzzy extractor implies the existence of an information-theoretic fuzzy extractor with slightly weaker parameters. The condition is that the generation procedure of the fuzzy extractor is efficiently invertible by an ...

متن کامل

Robust Fuzzy Extractors and Helper Data Manipulation Attacks Revisited: Theory vs Practice

Fuzzy extractors have been proposed in 2004 by Dodis et al. as a secure way to generate cryptographic keys from noisy sources. In recent years, fuzzy extractors have become an important building block in hardware security due to their use in secure key generation based on Physical Unclonable Functions (PUFs). Fuzzy extractors are provably secure against passive attackers. A year later Boyen et ...

متن کامل

On the Limits of Computational Fuzzy Extractors

Fuller et al. (Asiacrypt 2013) studied on computational fuzzy extractors, and showed, as a negative result, that the existence of a computational “secure sketch” implies the existence of an information-theoretically secure sketch with slightly weaker parameters. In this work, we show a similar negative result such that, under some computational assumption, the existence of a computational fuzzy...

متن کامل

From Watermarks to Fuzzy Extractors: a Practical Construction

Fuzzy extractors are a powerful tool to extract randomness from noisy data. A fuzzy extractor can extract randomness only if the source data is discrete while in practice source data is continuous. Using quantizers to transform continuous data into discrete data is a commonly used solution. However, as far as we know no study has been made of the effect of the quantization strategy on the perfo...

متن کامل

Practical Reusable Fuzzy Extractors for the Set Difference Metric and Adaptive Fuzzy Extractors

A fuzzy extractor (Dodis et al., Eurocrypt 2004) is a pair of procedures that turns a noisy secret into a uniformly distributed key R. To eliminate noise, the generation procedure takes as input an enrollment value ω and outputsR and a helper string P that enables further reproduction ofR from some close reading ω′. Boyen highlighted the need for reusable fuzzy extractors (CCS 2004) that remain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007